N-th digit computation
نویسندگان
چکیده
Xavier Gourdon and Pascal Sebah February 12, 2003 Is it possible to compute directly the n-th digit of π without computing all its first n digits ? At first sight, the problem seems of the same complexity. Recently [1], a formula which permits to find directly the n-th bit of π with very little memory and in quasi-linear time was exhibited. In other words, the question has a positive answer in base 2.
منابع مشابه
Computation of the n-th decimal digit of π with low memory
This paper presents an algorithm that computes directly the n-th decimal digit of π in sub-quadratic time and very low memory. It improves previous results of Simon Plouffe, later refined by Fabrice Bellard. The problem of the n-th digit computation in base 2 had already been successfully treated thanks to the use of appropriate series, but no corresponding formula for the question in base 10 h...
متن کاملOn the rapid computation of various polylogarithmic constants
We give algorithms for the computation of the d-th digit of certain transcendental numbers in various bases. These algorithms can be easily implemented (multiple precision arithmetic is not needed), require virtually no memory, and feature run times that scale nearly linearly with the order of the digit desired. They make it feasible to compute, for example, the billionth binary digit of log (2...
متن کاملNumerical Computation with Rational Number Arithmetic
where a, b, c, d are multi-digit integers. Since the product of two n-digit integers becomes 2n-digit, every multiplication operation doubles number of digits of the numerator and the denominator. Rational number computation divides them by their GCD to get irreducible form after every operation. We develop a computing environment in which multi-digit integer such as a, b, c, d in above express...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملOn a symmetric space attached to polyzeta values
Quickly converging series are given to compute polyzeta numbers ζ(r1, . . . , rk). The formulas involve an intricate combination of (generalized) polylogarithms at 1/2. However, the combinatoric has a very simple geometric interpretation: it corresponds with the map p 7→ p on a certain symmetric space P . Introduction: Let k ≥ 1. For a k-uple (r1, r2, . . . , rk) of positive integers, set ζ(r1,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003